A fast and efficient algorithm for the Fisher exact test
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولIs Fisher ’ s exact test very conservative ?
There are various two-tailed test versions of Fisher’s exact test for analyzing a 2~ 2 table. In this paper, the optimal version is selected on the basis of the concept of mean power (arranging in order from the smallest to the largest hypergeometrical probability, and in the case of a tie, arranging in order from the largest to the smallest value of the odds-ratio), and this selection is as va...
متن کاملWhen To Use Fisher ’ s Exact Test
Six Sigma practitioners occasionally conduct studies to assess differences between items such as operators or machines. When the experimental data are measured on a continuous scale (measuring nozzle diameter in microns, for example), a procedure such as “Student’s” two-sample t-test may be appropriate. When the response variable is recorded using counts, however, Karl Pearson’s test may be emp...
متن کاملthe relationship between eq, iq and test format: a study on test fairness
the major aim of this study was to investigate the relationship between iq, eq and test format in the light of test fairness considerations. this study took this relationship into account to see if people with different eq and iq performed differently on different test formats. to this end, 90 advanced learners of english form college of ferdowsi university of mashhad were chosen. they were ask...
15 صفحه اولA Flexible and Efficient Algorithm for Regularized Fisher Discriminant Analysis
Fisher linear discriminant analysis (LDA) and its kernel extension— kernel discriminant analysis (KDA)—are well known methods that consider dimensionality reduction and classification jointly. While widely deployed in practical problems, there are still unresolved issues surrounding their efficient implementation and their relationship with least mean squared error procedures. In this paper we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods, Instruments, & Computers
سال: 1987
ISSN: 0743-3808,1532-5970
DOI: 10.3758/bf03202590